A five element basis for the uncountable linear orders

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Five Element Basis for the Uncountable Linear Orders

In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear orders has a five element basis. In fact such a basis follows from the Proper Forcing Axiom, a strong form of the Baire Category Theorem. The elements are X , ω1,...

متن کامل

Uncountable Linear Orders

Two important classes of linear orders that are not σ-scattered are the real types and the Aronszajn types: the real types are those uncountable dense linear orders that are separable; the Aronszajn types are those linear orders that are uncountable and yet have no uncountable suborders that are scattered or real types. This latter class was considered—and proved nonempty—long ago by Aronszajn ...

متن کامل

Bounding the Consistency Strength of a Five Element Linear Basis

In [13] it was demonstrated that the Proper Forcing Axiom implies that there is a five element basis for the class of uncountable linear orders. The assumptions needed in the proof have consistency strength of at least infinitely many Woodin cardinals. In this paper we reduce the upper bound on the consistency strength of such a basis to something less than a Mahlo cardinal, a hypothesis which ...

متن کامل

Computability and uncountable Linear Orders II: degree spectra

We study the computable structure theory of linear orders of size א1 within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.

متن کامل

Computability and uncountable Linear Orders I: Computable Categoricity

We study the computable structure theory of linear orders of size א1 within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematics

سال: 2006

ISSN: 0003-486X

DOI: 10.4007/annals.2006.163.669